Planar Ramsey Numbers for Small Graphs
نویسنده
چکیده
Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n vertices either contains a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been determined, when both, G1 and G2 are complete graphs or both are cycles. By combining computer search with some theoretical results, in this paper we compute most of the planar Ramsey numbers PR(G1, G2), where each of G1 and G2 is a complete graph, a cycle or a complete graph without one edge.
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملGraph classes and Ramsey numbers
For a graph class G and any two positive integers i and j, the Ramsey number RG(i, j) is the smallest positive integer such that every graph in G on at least RG(i, j) vertices has a clique of size i or an independent set of size j. For the class of all graphs, Ramsey numbers are notoriously hard to determine, and they are known only for very small values of i and j. Even if we restrict G to be ...
متن کاملA Note on Planar Ramsey Numbers for a Triangle Versus Wheels
We assume that the reader is familiar with standard graph-theoretic terminology and refer the readers to Bondy and Murty (2008) for any concept and notation that is not defined here. In this paper, we consider simple, undirected graphs. Given two graphsG andH , the Ramsey numberR(G,H) is the smallest integer n such that every graph F on n vertices contains a copy of G, or its complement F conta...
متن کاملPlanar Ramsey numbers for cycles
For two given graphs G and H the planar Ramsey number PR(G,H) is the smallest integer n such that every planar graph F on n vertices either contains a copy of G or its complement contains a copy H . By studying the existence of subhamiltonian cycles in complements of sparse graphs, we determine all planar Ramsey numbers for pairs of cycles.
متن کاملRamsey numbers for bipartite graphs with small bandwidth
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assump...
متن کامل